Fragmented Reasoning in Natural Language: A Research Program

نویسنده

  • Iddo Lev
چکیده

A common practice in Linguistics today is to analyze the meaning of natural language (NL) using logic. The meaning of a sentence is defined in terms of some truth conditions on a set-theoretical model structure. The translation from sentences to truth conditions is done via an intermediate precise logical language in a compositional way: each syntactic tree of a phrase in the NL is associated with an expression in the logical language (and thereby with a corresponding set-theoretic object in the model), and the meaning expression of a tree is determined by the meaning expressions of its subtrees. This logical characterization is very useful because it provides a mathematically precise description of the meaning of sentences (and their parts). Thus it is possible to see clearly the relation between the meanings of different sentences in terms of equivalence, entailment, contradiction, and so on. Nevertheless, the logical language is usually much more powerful than first-order logic (FOL). Hence, the induced semantic entailment relation is not finitely axiomatizable, and the question whether an arbitrary formula in the logical language is entailed by another is not even semi-decidable. Therefore no computer program could obtain all the valid inferences from a translation of NL text to the logic. But this is not merely a defect of the translation: no computer program could obtain all the valid inferences from a NL text because FOL is a (small) fragment of NL. If we believe in the Church-Turing thesis (that everything that is computable is computable by a Turing machine), then this fact means that also humans are not able to draw all the valid conclusions from NL text. But clearly humans are able to understand NL and draw sufficient inferences from given information in an efficient way. How do they do that? Science is presently far from being able to answer this question. However, one idea that has been suggested as a possible direction for an explanation is that humans do not employ the equivalent of a single massive logical apparatus that takes care of all the inferences, but rather employ many different loosely connected inference modules, each of which specializes on inferences of one kind in a tractable and efficient way. Further “facilitators” combine the results of these modules and transfer information between them. The goal of the research program proposed here is to identify useful types of inferences that are based on NL phenomena. Each inference type provides only a small fragment of the full inference capacity underlying (the translation to logic of) NL, but it is computationally tractable, and (hopefully) complete in some sense (as will be explained below).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning from Reading Syntactically Complex Biology Texts

This paper concerns learning information by reading natural language texts. The major aim is to develop representations which are understandable by a reasoning engine and can be used to answer questions. We use abduction for mapping natural language data into concise and speci c theories underlying the textual data. Techniques for automatically generating usable data representations are discuss...

متن کامل

Dagstuhl Seminar 16161 Natural Language Argumentation : Mining , Processing , and Reasoning over Textual Arguments

This report documents the program and the outcomes of Dagstuhl Seminar 16161 “Natural Language Argumentation: Mining, Processing, and Reasoning over Textual Arguments”, 17–22 April 2016. The seminar brought together leading researchers from computational linguistics, argumentation theory and cognitive psychology communities to discuss the obtained results and the future challenges of the recent...

متن کامل

Proceedings of the 1 st Workshop on Natural Language Processing and Automated Reasoning ( NLPAR ) 2013

This volume contains the papers presented at NLPAR2013: Workshop on Natural Language Processing and Automated Reasoning 2013 held on September 15, 2013 in A Corunna, Spain. The NLPAR Workshop received 6 submissions from different international institutions and research communities. Each submission was reviewed by 3 program committee members. The committee decided to accept 5 papers. The program...

متن کامل

A Multilevel Natural Language Query Approach for Conversational Agent Systems

The main aim of this research is to investigate a novel technique for implementing a conversational intelligent agent system on the web. The research will focus on a multilevel natural language query approach. While the present World Wide Web provides a distributed hypermedia interface to the vast amount of information on the Internet, there is a lack of appropriate metadata to that content. In...

متن کامل

Understanding Without Proofs

The paper describes the analysis part of a running analysis and generation program for natural language. The system is entirely oriented to matching meaningful patterns onto fragmented paragraph length input. Its core Is a choice system based on what I call "semantic density". The system is contrasted with (1) syntax oriented linguistic approaches and (2) theorem proving approaches to the under...

متن کامل

Towards the Mechanical Verification of Textbook Proofs

Our goal is to implement a program for the machine verification of textbook proofs. We study the task from both the linguistics and automated reasoning perspective and give an in-depth analysis for a sample textbook proof. We propose a framework for natural language proof understanding that extends and integrates state-of-the-art technologies from Natural Language Processing (Discourse Represen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003